Functional Dependencies for Object Databases

نویسندگان

  • Hans-Joachim Klein
  • Jochen Rasch
چکیده

There is an increasing use of object oriented methods (e.g. [Ru91], [UML97]) for the design of database applications and databases themselves. Like the Entity–Relationship model and its variants, structural models of these methods provide rich modelling concepts for specifying object schemas. Some kinds of integrity constraints, e.g. referential integrity constraints or cardinality constraints for relationships, can be specified with the help of schema elements along with the schema definition. Constraints not coverable by schema elements are considered as “general integrity constraints”. They are often described by means of a declarative, logic based language or in a procedural style by using methods. In the relational data model several families of integrity constraints such as functional dependencies, inclusion dependencies, or null constraints are distinguished. Such a separation into families of constraints is less common for object models. One reason for this may be the fact that because of the concepts available for structuring schemas some families do not have the same relevance for the schema design process as they have in connection with relational schemas ([Kh93]). From a database perspective, however, features such as access paths for object types and value based identification criteria seem to require a more explicit treatment of constraints, especially of functional dependencies. Both are of great importance in connection with the implementation of object schemas using relational database systems. Not only into this regard a formal approach to functional dependencies for object schemas including inference rules could enjoy several advantages.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INSTITUT FÜR INFORMATIK UND PRAKTISCHE MATHEMATIK Functional Dependencies for Object Databases: Motivation and Axiomatization

Object identification by abstract identifiers should be considered as a modeling and not as a database concept. This means that object identifiers are not appropriate for the access to specific objects using a database language. In this paper we discuss how the relational concept of a functional dependency can be adapted to object databases in order to get more convenient ways of accessing obje...

متن کامل

On value based identification in object oriented data models

Object identity is a fundamental concept of object orientation. Objects are distinguishable even if they coincide in all their externally visible properties, i.e. values and relationships. In data models this abstract concept is usually realized by internal object identifiers to which the query language of the data model does not provide direct access. Therefore, in general, objects have to be ...

متن کامل

Printed in Great Britain ORDERED FUNCTIONAL DEPENDENCIES IN RELATIONAL DATABASES

We extend the relational data model to incorporate linear orderings into data domains which we call the ordered relational model The conventional Functional Dependencies FDs are examined in the context of ordered relational databases by using the notion of System Ordering Independence SOI which refers to the desirable scenario that the ordering of tuples in a relation is independent of the impl...

متن کامل

Defining and Mining Functional Dependencies in Probabilistic Databases

Functional dependencies – traditional, approximate and conditional are of critical importance in relational databases, as they inform us about the relationships between attributes. They are useful in schema normalization, data rectification and source selection. Most of these were however developed in the context of deterministic data. Although uncertain databases have started receiving attenti...

متن کامل

Weak Functional Dependencies: Full Propositional Expressiveness for the Database Practitioner

We study inference systems of weak functional dependencies in relational and complex-value databases. Functional dependencies form a very common class of database constraints. Designers and administrators proficiently utilise them in everyday database practice. Functional dependencies correspond to the linear-time decidable fragment of Horn clauses in propositional logic. Weak functional depend...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997